The baker’s map with a convex hole
نویسندگان
چکیده
منابع مشابه
Escape through a time-dependent hole in the doubling map.
We investigate the escape dynamics of the doubling map with a time-periodic hole. Ulam's method was used to calculate the escape rate as a function of the control parameters. We consider two cases, oscillating or breathing holes, where the sides of the hole are moving in or out of phase respectively. We find out that the escape rate is well described by the overlap of the hole with its images, ...
متن کاملDisparity-Map-Based Rendering for Hole Prevention
A popular way to convert video is given by depth image-based rendering methods, in which a depth that is associated with an image frame is used to generate a virtual view. An adaptive image warping approach as an improvement to the regular approach is proposed. The new algorithm (DMBR) exploits the smoothness of a typical depth map to reduce the complexity of the underlying optimization problem...
متن کاملThe mixed mode fracture mechanics in a hole plate bonded with two dissimilar plane
In the present research, the mixed-mode fracture mechanics analysis in a plate with central hole under tensile loading is considered. It is assumed that a plate containing two symmetrical hole-edge cracks is bonded with two dissimilar planes. The stress intensity factors at the crack tips are calculated. The problem is modeled in Casca software and this model is analyzed with Franc software. Th...
متن کاملAnalyzing Convex Relaxations for MAP Estimation
When faced with a difficult-to-solve problem, it is standard practice in the optimization community to resort to convex relaxations, that is, approximate the original problem using an easier (convex) problem. The widespread use of convex relaxations can be attributed to two factors: (i) recent advances in convex optimization imply that the relaxation can be solved efficiently; and (ii) the rela...
متن کاملTelling convex from reflex allows to map a polygon
We consider the exploration of a simple polygon P by a robot that moves from vertex to vertex along edges of the visibility graph of P. The visibility graph has a vertex for every vertex of P and an edge between two vertices if they see each other, i.e. if the line segment connecting them lies inside P entirely. While located at a vertex, the robot is capable of ordering the vertices it sees in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nonlinearity
سال: 2018
ISSN: 0951-7715,1361-6544
DOI: 10.1088/1361-6544/aab595